Bounds of Authentication Codeswith
نویسنده
چکیده
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states. Our main technique is a reduction of an A 2-code to a splitting A-code.
منابع مشابه
Lower Bound on the Size of Keys in Authentication Codes with Arbitration*
For the authentication codes with arbitration, Johansson showed lower bounds on the size of keys, but those bounds are no tighter if the size of source states is large. In the present paper , we first present some new lower bounds on the sizes of keys. Next, we discuss the case for large sizes of source states, and then we show that those bounds are tighter. Key-Words: Authentication, codes, ar...
متن کاملUnconditionally Secure Entity Authentication
This paper studies the entity-authentication problem in an information theoretic framework, where adversaries are innnitely powerful. We rst derive lower bounds on the cheating probability and the size of keys. Next, we show an unconditionally secure and optimum entity-authentication scheme that meets all our bounds.
متن کاملA TESLA-based mutual authentication protocol for GSM networks
The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against m...
متن کاملCombinatorial Bounds on Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states.
متن کاملCombinatorial Bounds for Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2 -codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities for A 2 -codes in terms of the number of source states, that of the whole messages and that of messages which the receiver accepts as authen...
متن کامل